package com.leetcode.June;

import javax.swing.tree.TreeNode;

/**
 * @Description: 二叉树的最大深度
 * @Author: Mr.Fxy
 * @CreateTime: 2024-07-20 22:46
 */
public class TreeMaxDepth {
    public int maxDepth(TreeNode root) {
//    return root ==null ? 0:Math.max(maxDepth(root.left),maxDepth(root.right))+1;
        return 0;
    }
}
